Conjugate separability in polycyclic groups

Subgroup Separability in Residually Free Groups

We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type FP∞ are virtual retracts. We describe a uniform solution to the membership problem for finitely presentable subgroups of residually free groups.

On Subgroup Separability in Hyperbolic Coxeter Groups

On Ordered Polycyclic Groups

It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpoten...

Separability of Solvable Subgroups in Linear Groups

Let Γ be a finitely generated linear group over a field of characteristic 0. Suppose that every solvable subgroup of Γ is polycyclic. Then any solvable subgroup of Γ is separable. This conclusion is false without the hypothesis that every solvable subgroup of Γ is polycyclic.

Generation of polycyclic groups

Polycyclic groups are one of the best understood class of groups. For example most of the decision problems are decidable in this class, see [7]. It seems surprising therefore that it is still an open problem whether there exists an algorithm which finds d(G) for any polycyclic group G (given by say a set of generators and relations). This is unknown even in the case when G is virtually abelian...